基于马尔可夫决策过程的医疗检查预约优化模型

医技部门的医疗检查如电子计算机断层扫描（CT）、核磁共振成像设备（MRI）、X射线（X－rays）常常有如下三种病人类型：门诊病人、住院病人和急诊病人。针对不同病人类型的需求特点，运用马尔可夫决策过程原理和动态规划方法，建立了医疗检查设备的预约优化模型，并证明了模型的最优性质，得出了不同病人类型的最优预约策略。数值算例的结果表明：本文的预约策略不仅易于实施，而且，通过该模型获得的最大收益比按传统先来先预约的模式所获得的收益要大。     

Global dynamics of a reaction–diffusion system with mass conservation

We study global dynamics of a mass conserved reaction–diffusion system. First, we show the global-in-time existence of the solution with compact orbit. Then the dynamical stability of local minima associated with a variational function is proven.     

Decolorization and mineralization of yellow 5 (E102) by UV/Fe2+/H2O2 process. Optimization of the operational conditions by response surface methodology

In this study, the optimization and implementation of a homogeneous photo-Fenton process for the decolorization and mineralization of a wastewater containing highly concentrated yellow 5 (E102) dye, resulting from an industry placed in the suburbs of Medellin (Colombia), is presented. Response surface methodology was applied as a tool for the optimization of operational conditions such as initial dyestuff concentration, H₂O₂ concentration, and UV-radiation power (number of lamps). The decolorization, degradation and mineralization efficiencies were used as response variables. The following conditions were found to be optimal for decolorization and mineralization of yellow 5: UV radiation of 365 nm (4 W, one lamp), dye concentration of 200 mg/L, Fe²⁺ concentration of 1.0 mM, H₂O₂ concentration of 1.75 mL/L, treatment time of 180 min, Fe²⁺ concentration of 1 mM and pH = 3. Under these conditions (180 min), the photo-Fenton process allowed us to reach ca. 100% of color dye degradation, 99% of COD degradation, and 85% of mineralization (TOC). The scavenging effect of the Cl^– anion on the photodegradation process was also confirmed.     

Protection of flows under targeted attacks

We present a new robust optimization model for the problem of maximizing the amount of flow surviving the attack of an interdictor. Given some path flow, our model allows the interdictor to specify the amount of flow removed from each path individually. In contrast to previous models, for which no efficient algorithms are known, the most important basic variants of our model can be solved in poly-time. We also consider extensions where there is a budget to set the interdiction costs.     

Hölder Continuity of the Saddle Point Set for Real-Valued Functions

This paper is concerned with Hölder continuity of the solution to a saddle point problem. Some new su?cient conditions for the uniqueness and Hölder continuity of the solution for a perturbed saddle point problem are established. Applications of the result on Hölder continuity of the solution for perturbed constrained optimization problems are presented under mild conditions. Examples are given to illustrate the obtained results.     

Nonmonotone Inexact Newton Method for the Extended Linear Complementarity Problem

This paper presents a nonmonotone inexact Newton-type method for the extended linear complementarity problem (ELCP). We first reformulate the optimization system of the ELCP problem into a system of smoothed equations. Then we solve this system by a nonmonotone inexact Newton-type algorithm. The global convergence is obtained and numerical tests for some classes of ELCP include linear complementarity, horizontal linear complementarity, and generalized linear complementarity problems are also given to show the e?ciency of the proposed algorithm.     

Algorithm of Barrier Objective Penalty Function

In this paper, an algorithm of barrier objective penalty function for inequality constrained optimization is studied and a conception–the stability of barrier objective penalty function is presented. It is proved that an approximate optimal solution may be obtained by solving a barrier objective penalty function for inequality constrained optimization problem when the barrier objective penalty function is stable. Under some conditions, the stability of barrier objective penalty function is proved for convex programming. Specially, the logarithmic barrier function of convex programming is stable. Based on the barrier objective penalty function, an algorithm is developed for finding an approximate optimal solution to an inequality constrained optimization problem and its convergence is also proved under some conditions. Finally, numerical experiments show that the barrier objective penalty function algorithm has better convergence than the classical barrier function algorithm.     

Incorporating model uncertainty into optimal insurance contract design

In stochastic optimization models, the optimal solution heavily depends on the selected probability model for the scenarios. However, the scenario models are typically chosen on the basis of statistical estimates and are therefore subject to model error. We demonstrate here how the model uncertainty can be incorporated into the decision making process. We use a nonparametric approach for quantifying the model uncertainty and a minimax setup to find model-robust solutions. The method is illustrated by a risk management problem involving the optimal design of an insurance contract.     

A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures

This paper investigates some properties of approximate efficiency in variable ordering structures where the variable ordering structure is given by a special set valued map. We characterize $\epsilon$-minimal and $\epsilon$- nondominated elements as approximate solutions of a multiobjective optimization problem with a variable ordering structure and give necessary and sufficient conditions for these solutions, via scalarization.     

Lot‐sizing policies for deterioration items under two‐level trade credit with partial trade credit to credit‐risk retailer and limited storage capacity

The main purpose of this article is to investigate the optimal wholesaler's replenishment decisions for deterioration items under two levels of the trade credit policy and two storage facilities in order to reflect the supply chain management situation within the economic order quantity framework. In this study, each of the following assumptions have been made: (1) The own warehouse with limited capacity always is not sufficient to store the order quantity, so that a rented warehouse is needed to store the excess units over the capacity of the own warehouse; (2) The wholesaler always obtains the partial trade credit, which is independent of the order quantity offered by the supplier, but the wholesaler offers the full trade credit to the retailer; (3) The wholesaler must take a loan to pay his or her supplier the partial payment immediately when the order is received and then pay off the loan with the entire revenue. Under these three conditions, the wholesaler can obtain the least costs. Furthermore, this study models the wholesaler's optimal replenishment decisions under the aforementioned conditions in the supply chain management. Two theorems are developed to efficiently determine the optimal replenishment decisions for the wholesaler. Finally, numerical examples are given to illustrate the theorems that are proven in this study, and the sensitivity analysis with respect to the major parameters in this study is performed. Copyright © 2016 John Wiley & Sons, Ltd.